Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Trajectory prediction of sea targets based on geodetic distance similarity calculation
Yijian ZHAO, Li LIN, Qianqian WANG, Peng WEN, Dong YANG
Journal of Computer Applications    2023, 43 (11): 3594-3598.   DOI: 10.11772/j.issn.1001-9081.2022101639
Abstract154)   HTML0)    PDF (1803KB)(137)       Save

The existing similarity-based moving target trajectory prediction algorithms are generally classified according to the spatial-temporal characteristics of the data, and the characteristics of the algorithms themselves cannot be reflected. Therefore, a classification method based on algorithm characteristics was proposed. The calculation of the distances between two points is required for the trajectory similarity algorithms to carry out the subsequent calculations, however, the commonly used Euclidean Distance (ED) is only applicable to the problem of moving targets in a small region. A method of similarity calculation using geodetic distance instead of ED was proposed for the trajectory prediction of sea targets moving in a large region. Firstly, the trajectory data were preprocessed and segmented. Then, the discrete Fréchet Distance (FD) was adopted as similarity measure. Finally, synthetic and real data were used to test. Experimental results indicate that when sea targets move in a large region, the ED-based algorithm may gain incorrect prediction results, while the geodetic distance-based algorithm can output correct trajectory prediction.

Table and Figures | Reference | Related Articles | Metrics
Research of the genetic-clustering algorithm considering the condition of planar adjacency relationship
HE Xiang-yang,PENG Wen-xiang,XUE Hui-feng
Journal of Computer Applications    2005, 25 (10): 2395-2397.  
Abstract1882)      PDF (595KB)(1159)       Save
The shortcomings about these days clustering algorithm considering the condition of planar adjacency relationship are analysised.The clustering algorithm considering the condition of planar adjacency relationship is defined again newly from the general clustering.In order to dealing with the clustering considering the condition of planar adjacency relationship,the concept adjacency matrix is defined.The genetic-clustering algorithm considering the condition of planar adjacency relationship is put forward,partitioning samples on the best-close distance and adjacency matrix,calculating cluster aim function on within-group sum of squares(WGSS) error,importing genetic algorithm.The algorithm is validated and compared with the FCM clustering outcome by examples.Algorithm testing show: the genetic-clustering algorithm considering the condition of planar adjacency relationship is completely feasible and availability.
Related Articles | Metrics